Disability Weights for Chronic Mercury Intoxication Resulting from Gold Mining Activities: Results from an Online Pairwise Comparisons Survey

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Disability Weights for Chronic Mercury Intoxication Resulting from Gold Mining Activities: Results from an Online Pairwise Comparisons Survey

In artisanal small-scale gold mining, mercury is used for gold-extraction, putting miners and nearby residents at risk of chronic metallic mercury vapor intoxication (CMMVI). Burden of disease (BoD) analyses allow the estimation of the public health relevance of CMMVI, but until now there have been no specific CMMVI disability weights (DWs). The objective is to derive DWs for moderate and sever...

متن کامل

Ancient Gold Mining Activities in India - An Overview

Gold was obtained through washing or panning of the river sands during initial periods of civilisation. With the advent of knowledge of metallurgical processing of ores it was recovered through mining of in-situ quartz reefs, and then from auriferous sulphide ores. The metal mining activities are evidenced in the form of large number of ‘ancient metal mines’ or ‘old workings’ and ‘placer mining...

متن کامل

Efficient Ranking from Pairwise Comparisons

The ranking of n objects based on pairwise comparisons is a core machine learning problem, arising in recommender systems, ad placement, player ranking, biological applications and others. In many practical situations the true pairwise comparisons cannot be actively measured, but a subset of all n(n−1)/2 comparisons is passively and noisily observed. Optimization algorithms (e.g., the SVM) coul...

متن کامل

Recommendation from Intransitive Pairwise Comparisons

In this paper we propose a full Bayesian probabilistic method to learn preferences from non-transitive pairwise comparison data. Such lack of transitivity easily arises when the number of pairwise comparisons is large, and they are given sequentially without allowing for consistency check. We develop a Bayesian Mallows model able to handle such data through a latent layer of uncertainty which c...

متن کامل

Approximate Ranking from Pairwise Comparisons

A common problem in machine learning is to rank a set of n items based on pairwise comparisons. Here ranking refers to partitioning the items into sets of pre-specified sizes according to their scores, which includes identification of the top-k items as the most prominent special case. The score of a given item is defined as the probability that it beats a randomly chosen other item. Finding an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Environmental Research and Public Health

سال: 2017

ISSN: 1660-4601

DOI: 10.3390/ijerph14010057